Evaluating Join Performance on Relational Database Systems

نویسندگان

  • Carlos Ordonez
  • Javier García-García
چکیده

The join operator is fundamental in relational database systems. Evaluating join queries on large tables is challenging because records need to be efficiently matched based on a given key. In this work, we analyze join queries in SQL with large tables in which a foreign key may be null, invalid or valid, given a referential integrity constraint. We conduct an extensive join performance evaluation on three DBMSs. Specifically, we study join queries varying table sizes, row size and key probabilistic distribution, inserting null, invalid or valid foreign key values. We also benchmark three well-known query optimizations: view materialization, secondary index and join reordering. Our experiments show certain optimizations perform well across DBMSs, whereas other optimizations depend on the DBMS architecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Parallel Join Processing in Object-Relational Database Systems

So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-based join processing in a parallel environment has not been investigated sufficiently. We present a performance study based on the BUCKY benchmark to compare parallel join processing using reference attributes with relational hash...

متن کامل

Set Containment Joins: The Good, The Bad and The Ugly

EÆcient support for set-valued attributes is likely to grow in importance as object-relational database systems, which either support set-valued attributes or propose to do so soon, begin to replace their purely relational predecessors. One of the most interesting and challenging operations on set-valued attributes is the set containment join, because it provides a concise and elegant way to ex...

متن کامل

A Comprehensive Survey of Join Techniques in Relational Databases

Equijoin between two relations is one of the basic operations in relational database and a large volume of research have been devoted to it. However, in recent years, there hasn't been a survey which objectively compares a wide spectrum of various join techniques in their relative performances. This survey compares performance and practicality between various join techniques. Main criteria for ...

متن کامل

Graceful Degradation for Top-Down Join Enumeration via similar sub-queries measure on Chip Multi-Processor

Most contemporary database systems query optimizers exploit System-R’s dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant sub-plans. However, in the relational database setting today, large queries containing many joins are becoming increasingly common. Based on this trend, it has become temping to improve the DP performance. Chip Multi-P...

متن کامل

Massively Parallel Relational Database Processing on the Connection Machine CM-2

Several research effort has been devoted to increase the performance of the relational database systems. Various types of database machines were so far proposed. Among them, shared nothing parallel database system such as Teradata, GAMMA, TANDEM are actually implemented and detail performance evaluation is undergoing. On the other hand, recently massively parallel processor like the Connection ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCSE

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2010